The generalized assignment problem with flexible jobs
نویسندگان
چکیده
منابع مشابه
The generalized assignment problem with minimum quantities
We consider a variant of the generalized assignment problem (GAP) where the amount of space used in each bin is restricted to be either zero (if the bin is not opened) or above a given lower bound (aminimum quantity). We provide several complexity results for different versions of the problem and give polynomial time exact algorithms and approximation algorithms for restricted cases. For the mo...
متن کاملFlexible Demand Assignment Problem
This paper proposed a state-of-the-art local search for solving Flexible Demand Assignment problem (FDA) which considers the balance between revenue and cost in demand assignment. Different than the published studies, our research splits the FDA problem into three core subproblems as operators for neighborhood construction. The three specified subproblems One Bin Repack, Two Bins Repack and Unp...
متن کاملThe Generalized Quadratic Assignment Problem
We study a generalization of the quadratic assignment problem (QAP) by allowing multiple equipments to be assigned at a single location as long as resources at the location permit. This problem arises in many real world applications such as facility location problem and logistics network design. We call the problem as the generalized quadratic assignment problem (GQAP) and show that this relaxa...
متن کاملThe Online Stochastic Generalized Assignment Problem
We present a 1 − 1 √ k -competitive algorithm for the online stochastic generalized assignment problem under the assumption that no item takes up more than 1 k fraction of the capacity of any bin. Items arrive online; each item has a value and a size; upon arrival, an item can be placed in a bin or discarded; the objective is to maximize the total value of the placement. Both value and size of ...
متن کاملThe Generalized Assignment Problem and Its Generalizations
The generalized assignment problem is a classical combinatorial optimization problem that models a variety of real world applications including flexible manufacturing systems [6], facility location [11] and vehicle routing problems [2]. Given n jobs J = {1, 2, . . . , n} and m agents I = {1, 2, . . . ,m}, the goal is to determine a minimum cost assignment subject to assigning each job to exactl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2009
ISSN: 0166-218X
DOI: 10.1016/j.dam.2008.04.017